Minimizing Communication in Numerical Linear Algebra
نویسندگان
چکیده
منابع مشابه
Minimizing Communication in Numerical Linear Algebra
In 1981 Hong and Kung proved a lower bound on the amount of communication (amount of data moved between a small, fast memory and large, slow memory) needed to perform dense, n-by-n matrix-multiplication using the conventional O(n3) algorithm, where the input matrices were too large to fit in the small, fast memory. In 2004 Irony, Toledo and Tiskin gave a new proof of this result and extended it...
متن کاملMinimizing Communication in Linear Algebra
In 1981 Hong and Kung [HK81] proved a lower bound on the amount of communication (amount of data moved between a small, fast memory and large, slow memory) needed to perform dense, n-by-n matrix-multiplication using the conventional O(n) algorithm, where the input matrices were too large to fit in the small, fast memory. In 2004 Irony, Toledo and Tiskin [ITT04] gave a new proof of this result a...
متن کاملCommunication lower bounds and optimal algorithms for numerical linear algebra
Acta Numerica / Volume 23 / May 2014, pp 1 155 DOI: 10.1017/S0962492914000038, Published online: 12 May 2014 Link to this article: http://journals.cambridge.org/abstract_S0962492914000038 How to cite this article: G. Ballard, E. Carson, J. Demmel, M. Hoemmen, N. Knight and O. Schwartz (2014). Communication lower bounds and optimal algorithms for numerical linear algebra . Acta Numerica, 23, pp ...
متن کاملNumerical Linear Algebra With
SUMMARY StratiGraph, a Java-based tool for computation and presentation of closure hierarchies of Jordan and Kronecker structures is presented. The tool is based on recent theoretical results on stratiications of orbits and bundles of matrices and matrix pencils. A stratiication reveals the complete hierarchy of nearby structures, information critical for explaining the qualitative behavior of ...
متن کامل“ Numerical Linear Algebra ” course
The main general reference for this and the next two lectures is a recent book [6] and its preliminary version [5] which is freely available on the web. 1 Why iterative methods? As we already know, there are two major classes of methods to solve linear systems: direct methods (like LU factorization, Cholesky factorization, etc.) and iterative methods. We underline the following properties of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2011
ISSN: 0895-4798,1095-7162
DOI: 10.1137/090769156